منابع مشابه
Finite Biprefix Sets of Path in a Graph
The main results of the combinatorial theory of maximal biprefix codes of words (Ckari, Perrin, Schtitzenberger) are extended to the codes of paths in a graph in this paper: degree and decoding of double-infinite paths, finiteness of codes of a given degree, the CCsari-Schiitzenberger algorithm, derivation and integration of codes will be discussed.
متن کاملConjugacy of finite biprefix codes
Two languagesX and Y are called conjugates, if they satisfy the conjugacy equationXZ = ZY for some non-empty language Z . We will compare solutions of this equation with those of the corresponding equation of words and study the case of finite biprefix codes X and Y . We show that themaximal Z in this case is rational.Wewill also characterize X and Y in the case where they are both finite bipre...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملTypical Paths of a Graph
We introduce (finite and infinite) typical paths of a graph and prove that the typical paths carry all information with probability 1, asymptotically. An automata-theoretic characterization of the typical paths is shown: finite typical paths can be accepted by reversal-bounded multicounter automata and infinite typical paths can be accepted by counting Büchi automata (a generalization of revers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90021-7